#define _CRT_SECURE_NO_WARNINGS 1
class Solution {
public:
    int lastStoneWeightII(vector<int>& stones) {
        int m = stones.size();
        int sum = 0;
        for (auto e : stones) sum += e;
        int n = sum / 2;

        vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));

        for (int i = 1; i <= m;i++)
        {
            for (int j = 0;j <= n;j++)
            {
                dp[i][j] = dp[i - 1][j];
                if (j >= stones[i - 1])
                    dp[i][j] = max(dp[i][j], dp[i - 1][j - stones[i - 1]] + stones[i - 1]);
            }
        }

        return sum - 2 * dp[m][n];

    }
};